Measuring skill: a multi-dimensional index

Measuring software volatility: a multi-dimensional approach

RSR-tree: A Dynamic Multi-dimensional Index Structure

A new dynamic multi-dimensional index structure called RSR-tree is proposed, in which splitting operations of leaf nodes and non-leaf nodes are performed separatively. RSR-tree retains the sequence ordering of index records in a leaf node of RS-tree and thus reduces the addressing time cost of disk access while reading data files. In addition, it integrates the characteristic of reducing the ov...

The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data indexing. Second, a variation to Guttman’s R-trees (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree is introduced. Algorithms for searching, updating, initial packing and ...

A Parameterized Index-Generator for the Multi-Dimensional Interleaving Optimization

The novel optimization technique for the design of application specific integrated circuits of multi-dimensional problems, called multi-dimensional interleaving consists of an expansion and compression of the iteration space. It guarantees that all functional elements of a circuitry can be executed simultaneously, and no additional memory queues proportional to the problem size are required. Su...

BRep-Index: A Multi-Dimensional Space Partitioning Tree

In this paper we introduce the brep-index, a new multi-dimensional space partitioning data structure that provides quick access to the vertices, edges and faces of a boundary representation (brep), thus yielding a single unified representation for polyhedral solids. We d~cribe the cortStruction of the brep-index and show that its size is O(v +e + f), where VI €I and J are the number of vertices...